A Cryptanalysis of the Original Domingo-Ferrer's Algebraic Privacy Homomophism
نویسندگان
چکیده
We propose a cryptanalysis of the original Domingo-Ferrer’s algebraic privacy homomorphism. We show that the scheme over Zn can be broken by d + 1 known plaintexts in O(d3 log n) time when it has d times expansion through the encryption. Furthermore even when the public modulus n is kept secret, it can be broken by d + 2 known plaintexts in time at most O(d5 log(dn)).
منابع مشابه
A Cryptanalysis of the Original Domingo-Ferrer’s Algebraic Privacy Homomorphism
We propose a cryptanalysis of the original Domingo-Ferrer’s algebraic privacy homomorphism. We show that the scheme over Zn can be broken by d + 1 known plaintexts in O(d3 log n) time when it has d times expansion through the encryption. Furthermore even when the public modulus n is kept secret, it can be broken by d + 2 known plaintexts in time at most O(d5 log(dn)).
متن کاملKnown-plaintext cryptanalysis of the Domingo-Ferrer algebraic privacy homomorphism scheme
We propose cryptanalysis of the First Domingo-Ferrer’s algebraic privacy homomorphism E :Zn → (Zp ×Zq)d where n= pq. We show that the scheme can be broken by (d+ 1) known plaintexts in O(d3 log2 n) time. Even when the modulus n is kept secret, it can be broken by 2(d + 1) known plaintexts in O(d4 logdn+ d3 log2 n+ ε(m)) time with overwhelming probability. 2005 Elsevier B.V. All rights reserved.
متن کاملGame-Based Cryptanalysis of a Lightweight CRC-Based Authentication Protocol for EPC Tags
The term "Internet of Things (IoT)" expresses a huge network of smart and connected objects which can interact with other devices without our interposition. Radio frequency identification (RFID) is a great technology and an interesting candidate to provide communications for IoT networks, but numerous security and privacy issues need to be considered. In this paper, we analyze the security and ...
متن کاملPrivacy Homomorphism for Delegation of the Computations
The idea of privacy homomorphism (PH) was firstly introduced by Rivest, Adleman and Dertouzos [1]. They proposed several PHs to process encrypted data without decrypting. A PH is an encryption function which allows the processing the encrypted data without decryption. Formally privacy homomorphism can be defined as an encryption function e which has efficient algorithms to compute e (xy) and e ...
متن کاملImplementation of Domingo Ferrer's a New Privacy Homomorphism (DF a New PH) in Securing Wireless Sensor Networks (WSN)
Wireless Sensor Networks’ (WSN) Data aggregation is substantial in eliminating information redundancy and increasing the lifetime of the network. However, in its implementation, the data are being transmitted in clear hence are prone to security attacks. The Homomorphic Encryption Schemes (HES) provide the most advantage in securing the data on limitedresourced WSN devices by allowing operation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2003 شماره
صفحات -
تاریخ انتشار 2003